Focal radius, rigidity, and lower curvature bounds
نویسندگان
چکیده
منابع مشابه
Measure Rigidity of Ricci Curvature Lower Bounds
The measure contraction property, MCP for short, is a weak Ricci curvature lower bound conditions for metric measure spaces. The goal of this paper is to understand which structural properties such assumption (or even weaker modifications) implies on the measure, on its support and on the geodesics of the space. We start our investigation from the euclidean case by proving that if a positive Ra...
متن کاملLower Bounds on Ricci Curvature and the Almost Rigidity of Warped Products
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملThe Radius Rigidity Theorem for Manifolds of Positive Curvature
Recall that the radius of a compact metric space (X, dist) is given by rad X = minx∈X maxy∈X dist(x, y). In this paper we generalize Berger’s 1 4 -pinched rigidity theorem and show that a closed, simply connected, Riemannian manifold with sectional curvature ≥ 1 and radius ≥ π2 is either homeomorphic to the sphere or isometric to a compact rank one symmetric space. The classical sphere theorem ...
متن کاملCauchy’s Interlace Theorem and Lower Bounds for the Spectral Radius
We present a short and simple proof of the well-known Cauchy interlace theorem. We use the theorem to improve some lower bound estimates for the spectral radius of a real symmetric matrix.
متن کاملLower Bounds on Matrix Rigidity Via a Quantum Argument
The rigidity of a matrix measures how many of its entries need to be changed in order to reduce its rank to some value. Good lower bounds on the rigidity of an explicit matrix would imply good lower bounds for arithmetic circuits as well as for communication complexity. Here we reprove the best known bounds on the rigidity of the Hadamard matrix, due to Kashin and Razborov, using tools from qua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the London Mathematical Society
سال: 2018
ISSN: 0024-6115
DOI: 10.1112/plms.12113